Verification protocols with sub-linear communication for polynomial matrix operations

Formal Verification of Communication Protocols

In this paper we present a formal abstract speciication for TCP/IP transport level protocols and formally verify that TCP satisses this speciication. We also present a formal description of an experimental protocol, T/TCP, which proposes to provide the same service as TCP, but with optimizations to make it eecient for transactions. We further show that this protocol does not provide the same se...

Sub-linear Universal Spatial Gossip Protocols

Gossip protocols are communication protocols in which, periodically, every node of a network exchanges information with some other node chosen according to some (randomized) strategy. These protocols have recently found various types of applications for the management of distributed systems. Spatial gossip protocols are gossip protocols that use the underlying spatial structure of the network, ...

Directed search for the verification of communication protocols

Experimental Evaluation of Simplified Verification Methods for Responsive Communication Protocols

We consider responsiveness veri cation of communication protocols on the client-server system CSN , which consists of one client site and N (N 2) server sites, under the assumption that a single transient failure occurs on any one server site. For the veri cation, a typical naive method NAIV generates exhaustively all abnormal system states reachable after the failure, and then calculates the r...

Formal verification of communication protocols for wireless networks

Wireless networks have became in recent years a constant in the every day life of an increasing amount of people. In a virtuous circle, newer and more sophisticated protocols are designed every day, increasing the available tools and attracting even more users. However newer tools are needed to help designers on their job of creating better software and protocols for this kind of network. Tradi...